The Complexity of 3SAT_N and the P versus NP Problem
نویسنده
چکیده
We introduce the NP-complete problem 3SATN and extend Tovey’s results to a classification theorem for this problem. This classification theorem leads us to generalize the concept of truth assignments for SAT to aggressive truth assignments for 3SATN . All these aggressive truth assignments are pseudo-algorithms. We combine algorithm, pseudo-algorithm and diagonalization method to study the complexity of 3SATN and the P versus NP problem. The main result is P 6 = NP .
منابع مشابه
On the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملTowards NP−P via Proof Complexity and Search Draft — Comments Appreciated
This is a survey of work on proof complexity and proof search, as motivated by the P versus NP problem. We discuss propositional proof complexity, Cook’s program, proof automatizability, proof search, algorithms for satisfiability, and the state of the art of our (in)ability to separate P and NP .
متن کاملThe P versus NP Problem in Quantum Physics
Motivated by the fact that information is encoded and processed by physical systems, the P versus NP problem is examined in terms of physical processes. In particular, we consider P as a class of deterministic, and NP as nondeterministic, polynomial-time physical processes. Based on these identifications, we review a self-reference physical process in quantum theory, which belongs to NP but can...
متن کاملOn the relationship between classes P and NP
Problem statement: In this study we discuss the relationship between the known classes P and NP. We show that the difficulties in solving problem “P versus NP” have methodological in nature. An algorithm for solving any problem is sensitive to even small changes in its formulation. Conclusion/Recommendations: As we will show in the study, these difficulties are exactly in the formulation of som...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1101.2018 شماره
صفحات -
تاریخ انتشار 2011